Constant Queue Route on a Mesh
نویسندگان
چکیده
Packet routing is an important problem in parallel computation since a single step of inter-processor communication can be thought of as a packet routing task. In this paper we present an optimal algorithm for packet routing on a mesh-connected computer. Two important criteria for judging a routing algorithm will be 1) its run time, i.e., the number of parallel steps it takes for the last packet to reach its destination, and 2) its queue size, i.e., the maximum number of packets that any node will have to store at any time during routing. We present a 2n 2 step routing algorithm for an n x n mesh that requires a queue size of only 58. The previous best known result is a routing algorithm with the same time bound but with a queue size of 672. The time bound of 2n 2 is optimal. A queue size of 672 is rather large for practical use. We believe that the queue size of our algorithm is practical. The improvement in the queue size is possible due to (from among other things) a new 3s + o(s) sorting algorithm for an s x s mesh. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-90-25. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/516 Constant Queue Routing On A Mesh MS-CIS-90-25 GRASP LAB 211 Sangut hevar Rajasekaran Richard Overholt Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 19104-6389 Revised November 1990 Constant Queue Routing on a Mesh Sangut hevar Rajasekaran Richard Overholt Dept. of Computer and Information Science Univ. of Pennsylvania, Philadelphia, PA 19104
منابع مشابه
An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of Mesh. Our routing algorithm routes n2 elements on an n×n Mesh in 2n + O(log n) parallel communication steps with very high probability. Further, the maximum queue length at any node at any time is at the most O(log n) with the same probability. Since 2n is the distance bound for the Mesh, our alg...
متن کاملEffective Routing Scheme through Network Load-aware Route Metric in Multi-rate Wireless Mesh Networks
In multi-rate wireless mesh networks, a mesh node can dynamically modify the data rate on a particular link, in response to the perceived SNR ratio between neighbor nodes. In such networks, existing route selection schemes use a link quality metric based on the expected amount of medium time it takes to successfully transmit a packet. However, these schemes do not take into account the status o...
متن کاملOptimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the most kn + O(k logn) parallel communication steps, with a constant queue size of O(k). The previous best known algorithm [3] takes 5 4kn + O( kn f(n) ) steps with a queue size of O(k f(n)) (for any 1 ≤ f(n) ≤ n). We will also...
متن کاملConstant Queue Routing on a Mesh
Packet routing is an important problem in parallel computation since a single step of inter-processor communication can be thought of as a packet routing task. In this paper we present an optimal algorithm for packet routing on a mesh-connected computer. Two important criteria for judging a routing algorithm will be 1) its run time, i.e., the number of parallel steps it takes for the last packe...
متن کاملOptimal Randomized Algorithms for Multipacket and Wormhole Routing on the Mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k k) routing problem on an n x n mesh. The algorithm competes with high probability in at most kn + O(k log n) parallel communication steps, with a constant queue size of O(k). The previous best known algorithm [4] takes [5/4] kn + O([kn/f(n)]) steps with a queue size of O(k f(n)) (for any 1 ≤ f (n) ≤ n). We will also p...
متن کامل